class Solution:
def median(self, n , k, arr) -> int:
arr = arr[::-1]
ans = 0
start = n//2
val = start + 1
jump = 1
while jump <= k:
ans+= arr[start]
jump +=1
start = (start) +val
return ans
t = int(input())
for _ in range(t):
n, k = list(map(int, input().split()))
arr = list(map(int, input().split()))
obj = Solution()
print(obj.median(n, k, arr))#define _GLIBCXX_FILESYSTEM
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n , t , k , maximum , counter = 0 , input , reach;
long long sum = 0;
cin >> t;
vector < int > inputs;
while ( t-- ){
cin >> n >> k ;
sum = 0 , counter = 0;
reach = ceil( n / 2.0 );
for ( int i = 0 ; i < n*k ; i++ ){
cin >> input;
inputs.push_back(input);
}
for ( int i = n * k - 1 , j = n ; i >= 0 ; i-- ){
if ( j == reach ){
sum+= inputs[i];
j = n;
counter++;
}
else
j--;
if ( counter == k )
break;
}
cout << sum << endl;
inputs.clear();
}
}
1650C - Weight of the System of Nested Segments | 1097A - Gennady and a Card Game |
248A - Cupboards | 1641A - Great Sequence |
1537A - Arithmetic Array | 1370A - Maximum GCD |
149A - Business trip | 34A - Reconnaissance 2 |
59A - Word | 462B - Appleman and Card Game |
1560C - Infinity Table | 1605C - Dominant Character |
1399A - Remove Smallest | 208A - Dubstep |
1581A - CQXYM Count Permutations | 337A - Puzzles |
495A - Digital Counter | 796A - Buying A House |
67A - Partial Teacher | 116A - Tram |
1472B - Fair Division | 1281C - Cut and Paste |
141A - Amusing Joke | 112A - Petya and Strings |
677A - Vanya and Fence | 1621A - Stable Arrangement of Rooks |
472A - Design Tutorial Learn from Math | 1368A - C+= |
450A - Jzzhu and Children | 546A - Soldier and Bananas |